Gurevich Abstract State Machines and Schh Onhage Storage Modiication Machines

Gurevich Abstract State Machines and Schoenhage Storage Modification Machines

We demonstrate that Schonhage storage modi cation machines are equivalent, in a strong sense, to unary abstract state machines. We also show that if one extends the Schonhage model with a pairing function and removes the unary restriction, then equivalence between the two machine models survives.

Abstract State Machines: An Overview of the Project

State Machines: An Overview of the Project Yuri Gurevich Microsoft Research, One Microsoft Way, Redmond, WA 98052

The Linear Time Hierarchy Theorems for Abstract State Machines and RAMs

We prove the Linear Time Hierarchy Theorems for random access machines and Gurevich abstract state machines. One long-term goal of this line or research is to prove lower bounds for natural linear time problems.

THE LOGIC IN COMPUTER SCIENCE COLUMN by Yuri GUREVICH Algorithms vs. Machines

Yiannis Moschovakis argues that some algorithms, and in particular the mergesort algorithm, cannot be adequately described in terms of machines acting on states. We show how to describe the mergesort algorithm, on its natural level of abstraction, in terms of distributed abstract state machines.

Verification of Timed Algorithms: Gurevich Abstract State Machines versus First Order Timed Logic